Topic structures and minimal effort

Minimal Effort Ingest

Range Analysis of Binaries with Minimal Effort

COTS components are ubiquitous in military, industrial and governmental systems. However, the benefits of reduced development and maintainance costs are compromised by security concerns. Since source code is unavailable, security audits necessarily occur at the binary level. Push-button formal method techniques, such as model checking and abstract interpretation, can support this process by, am...

Optimal link categorization for minimal retrieval effort

Various studies have shown that categorizing search results can help users to retrieve their target pages faster. The categorizations save the users the time needed to consider links from irrelevant categories. However, what is often missed out is that the category selections also introduce extra effort for users who are looking for one of the highest ranked results. In general, the expected ga...

Unimodular Minimal Structures

A strongly minimal structure D is called unimodular if any two finite-to-one maps with the same domain and range have the same degree; that is if/4: (/-»• V is everywhere fc4-to-l, then kx = kc,. THEOREM. Unimodular strongly minimal structures are locally modular. This extends Zil'ber's theorem on locally finite strongly minimal sets, Urbanik's theorem on free algebras with the Steinitz propert...

On Minimal Ordered Structures

We partially describe minimal, first-order structures which have a strong form of the strict order property. An infinite first-order structure is minimal if its each definable (possibly with parameters) subset is either finite or co-finite. It is strongly minimal if the minimality is preserved in elementarily equivalent structures. While strongly minimal structures were investigated more closel...